Intersection types and runtime errors in the pi-calculus
نویسندگان
چکیده
منابع مشابه
Linearity, session types and the Pi calculus
We present a reconstruction of session types in a conventional pi calculus. Our session types are qualified as linear or unrestricted. Linearly typed communication channels are guaranteed to occur in exactly one thread, possibly multiple times; afterwards they evolve to unrestricted channels. We equip types with a constructor that describes the two ends of a same communication channel, and prop...
متن کاملIntersection Types for the λμ-Calculus
We introduce an intersection type system for the pure λμ-calculus, which is invariant under subject reduction and expansion. The system is obtained by describing Streicher and Reus’s denotational model of continuations in the category of omega-algebraic lattices via Abramsky’s domain logic approach. This provides at the same time an interpretation of the type system and a proof of the completen...
متن کاملIntersection Types for the lambda-mu Calculus
We introduce an intersection type system for the λμ-calculus that is invariant under subject reduction and expansion. The system is obtained by describing Streicher and Reus’s denotational model of continuations in the category of ω-algebraic lattices via Abramsky’s domain-logic approach. This provides at the same time an interpretation of the type system and a proof of the completeness of the ...
متن کاملSpatial and Behavioral Types in the Pi-Calculus
We present a framework that combines ideas from spatial logics and Igarashi and Kobayashi’s behavioural type systems, drawing benefits from both. In our approach, type systems for the pi-calculus are introduced where newly declared (restricted) names are annotated with spatial process properties, predicating on those names, that are expected to hold in the scope of the declaration. Types are ak...
متن کاملIntersection and Union Types in the λμμ̃-calculus
The original λμe μ of Curien and Herbelin has a system of simple types, based on sequent calculus, embodying a Curry-Howard correspondence with classical logic. We introduce and discuss three type assignment systems that are extensions of λμe μ with intersection and union types. The intrinsic symmetry in the λμe μ calculus leads to an essential use of both intersection and union types.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ACM on Programming Languages
سال: 2019
ISSN: 2475-1421
DOI: 10.1145/3290320